Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem
نویسندگان
چکیده
Following Ajtai’s lcad, Ajtai and Dwork have recently introduced a public-key encryption scheme which is secure under the assumption that a certain computational problem on lattices is hard on the worst-case. Their encryption method m a y cause decryption errors, though with small probability (i.e., inversely proportional to the security parameter). In this paper we modify the encryption method of Ajtai and Dwork so that the legitimate receiver always recovers the message sent. That is, we make the -4jtai-Dwork Cryptosystem error-free.
منابع مشابه
Abuses of Ajtai-Dwork Cryptosystem
Ajtai and Dwork 2] have recently introduced a probabilistic public-key en-cryption scheme which is secure under the assumption that a certain computational problem on lattices is hard on the worst-case. Their encryption method may cause decrytion errors, though with small probability. Goldre-ich, Goldwasser, and Halevi 7] later modiied the encryption method of Ajtai and Dwork and made Ajtai-Dwo...
متن کاملA Complete Public-Key Cryptosystem
We present a cryptosystem which is complete for the class of probabilistic public-key cryptosystems with bounded error. Besides traditional encryption schemes such as RSA and El Gamal, this class contains probabilistic encryption of Goldwasser-Micali as well as Ajtai-Dwork and NTRU cryptosystems. The latter two are known to make errors with some small positive probability. To our best knowledge...
متن کاملMulti-bit Cryptosystems Based on Lattice Problems
We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtai-Dwork cryptosystem by Goldreich, Goldwasser, and Halevi [CRYPTO ’97], the Regev cryptosystems [JACM 2004 and STOC 2005], and the Ajtai cryptosystem [STOC 2005]. We develop a universal technique derived from a general structure behind them for constructing their multi-...
متن کاملCryptanalysis of the Ajtai-Dwork Cryptosystem
Recently, Ajtai discovered a fascinating connection between the worst-case complexity and the average-case complexity of some wellknown lattice problems. Later, Ajtai and Dwork proposed a cryptosystem inspired by Ajtai’s work, provably secure if a particular lattice problem is difficult in the worst-case. We present a heuristic attack (to recover the private key) against this celebrated cryptos...
متن کاملCryptanalysis of the Ajtai - Dwork
Recently, Ajtai discovered a fascinating connection between the worst-case complexity and the average-case complexity of some well-known lattice problems. Later, Ajtai and Dwork proposed a cryptosystem inspired by Ajtai's work, provably secure if a particular lattice problem is diicult in the worst-case. We present a heuristic attack (to recover the private key) against this celebrated cryptosy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997